On a vertex-minimal triangulation of RP

نویسنده

  • Sonia Balagopalan
چکیده

We give three constructions of a vertex-minimal triangulation of 4-dimensional real projective space RP4. The first construction describes a 4-dimensional sphere on 32 vertices, which is a double cover of a triangulated RP4 and has a large amount of symmetry. The second and third constructions illustrate approaches to improving the known number of vertices needed to triangulate n-dimensional real projective space. All three constructions deliver the same combinatorial manifold, which is also the same as the only known 16-vertex triangulation of RP4. We also give a short, simple construction of the 22-point Witt design, which is closely related to the complex we construct.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Survey of Results on Minimal Triangulations

For any closed compact 2-manifold, there is a finite number of minimal (irreducible) triangulation. Thus, we may obtain any triangulation of a surface by splitting vertices of a minimal triangulation of the surface. The number of vertices in these minimal triangulations is linear in the genus of the underlying surface.

متن کامل

Constructing Piecewise Linear

Let P = fp1; : : : ; png and Q = fq1; : : : ; qng be two point sets lying in the interior of rectangles in the plane. We show how to construct a piecewise linear homeomorphism of size O(n2) between the rectangles which maps pi to qi for each i. This bound is optimal in the worst case; i.e., there exist point sets for which any piecewise linear homeomorphism has size (n2). Introduction A homeomo...

متن کامل

Some Results on Forgotten Topological Coindex

The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...

متن کامل

A ug 2 01 0 From the icosahedron to natural triangulations of CP 2 and S 2 × S

We present two constructions in this paper : (a) A 10-vertex triangulation CP 2 10 of the complex projective plane CP 2 as a subcomplex of the join of the standard sphere (S 2 4 ) and the standard real projective plane (RP 2 6 , the decahedron), its automorphism group is A4; (b) a 12-vertex triangulation (S 2×S )12 of S 2×S 2 with automorphism group 2S5, the Schur double cover of the symmetric ...

متن کامل

A wide-range algorithm for minimal triangulation from an arbitrary ordering

We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm) time implementation and a more involved O(nm) time implementation, thus matching the best known algorithms for this problem. Our algorithm is based on a process by Lekkerkerker and Boland for recognizing chordal graphs which checks in an arbitrary order whether the minimal s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017